fast Computation of 3-D Geometric Moments Using a Discrete Gauss' Theorem
نویسندگان
چکیده
A discrete Gauss' theorem is presented. Using a fast surface tracking algorithm and the discrete Gauss' theorem, we design a new method to compute the Cartesian geometric moments of 3-D objects. Compared to previous methods to compute such moments, the new method reduces the computational complexity signi cantly.
منابع مشابه
Fast and Exact Computation of Moments Using Discrete Green's Theorem
Green's theorem evaluates a double integral over the region of an object by a simple integration along the boundary of the object. It has been used in moment computation since the shape of a binary object is totally determined by its boundary. By using a discrete analogue of Green's theorem, we present a new algorithm for fast computation of geometric moments. The algorithm is faster than previ...
متن کاملExact and fast computation of geometric moments for gray level images
Geometric moments are widely used in image processing and pattern recognition. While several methods have been proposed, exact geometric moment’s computation for gray level images is still unavailable. In this paper exact values of geometric moments are calculated using mathematical integration of the monomial terms over digital image pixels. This method removed the numerical approximation erro...
متن کاملON AN EXTENSION OF A QUADRATIC TRANSFORMATION FORMULA DUE TO GAUSS
The aim of this research note is to prove the following new transformation formula begin{equation*} (1-x)^{-2a},_{3}F_{2}left[begin{array}{ccccc} a, & a+frac{1}{2}, & d+1 & & \ & & & ; & -frac{4x}{(1-x)^{2}} \ & c+1, & d & & end{array}right] \ =,_{4}F_{3}left[begin{array}{cccccc} 2a, & 2a-c, & a-A+1, & a+A+1 & & \ & & & & ; & -x \ & c+1, & a-A, & a+A & & end{array} right], end{equation*} wher...
متن کاملA Novel Symmetry-based Method for Efficient Computation of 2d and 3d Geometric Moments
Moment invariants are widely used in reconstruction, recognition and discrimination of 2D and 3D images. Accurate and efficient computation of these moment invariants is a big challenge to the community of image processing and pattern recognition. Since the wide class of moment invariants of digital images is generally expressed as a combination of geometric moments, highly accurate and efficie...
متن کاملThe fast Gauss transform with complex parameters q
We construct a fast method, OðN logNÞ, for the computation of discrete Gauss transforms with complex parameters, capable of dealing with unequally spaced grid points. The method is based on Fourier techniques, and in particular it makes use of a modified unequally spaced fast Fourier transform algorithm, in combination with previously suggested divide and conquer strategies for ordinary fast Ga...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995